xk xk 1 2
c336346c777707e09cab2a3c79174d90-Supplemental.pdf
We also establish new convergence complexities to achieve an approximate KKT solution when the objective can be smooth/nonsmooth, deterministic/stochastic and convex/nonconvex with complexity that is on a par with gradient descent for unconstrained optimization problems in respective cases. To the best of our knowledge, this is the first study of the first-order methods with complexity guarantee for nonconvex sparse-constrained problems.
Country:
- Asia > China > Shanghai > Shanghai (0.04)
- North America > United States > Texas > Dallas County > Dallas (0.04)
- North America > United States > Georgia > Fulton County > Atlanta (0.04)
- North America > Canada > British Columbia > Metro Vancouver Regional District > Vancouver (0.04)
Technology:
Country:
- Asia > Middle East > Jordan (0.04)
- Asia > China (0.04)
Technology: